On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
نویسندگان
چکیده
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented an algorithm with three states for the problem of mutual exclusion on a ring of processors. In [BD95] a similar three state algorithm with an upper bound of 5 3 4n 2 + O(n) and a lower bound of 1 8n 2 − O(n) were presented for its stabilization time. For this later algorithm we prove an upper bound of 1 12n 2 + O(n), and show a lower bound of n −O(n).
منابع مشابه
Vers l'auto-stabilisation des systèmes à grande échelle. (Toward self-stabilizing large-scale systems)
. In Gerard Tel and PaulM. B. Vitányi, editors,Distributed Al-gorithms, 8th International Workshop, WDAG ’94, volume 857 of LectureNotes in Computer Science, pages 326–339. Springer, 1994. [11] Joffroy Beauquier, Béatrice Bérard, Laurent Fribourg, and FrédéricMagniette. Proving convergence of self-stabilizing systems usingfirst-order rewriting and regular languages. Distributed ...
متن کاملSelf-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering (Extended Version)
This paper presents and proves correct two self-stabilizing deterministic algorithms solving the mutual exclusion and the group mutual exclusion problems in the model of population protocols with covering. In this variant of the population protocol model, a local fairness is used and bounded state anonymous mobile agents interact in pairs according to constraints expressed in terms of their cov...
متن کاملSelf-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering
This paper presents and proves correct two self-stabilizing deterministic algorithms solving the mutual exclusion and the group mutual exclusion problems in the model of population protocols with covering. In this variant of the population protocol model, a local fairness is used and bounded state anonymous mobile agents interact in pairs according to constraints expressed in terms of their cov...
متن کاملSelf-stabilizing mutual exclusion on a ring, even if K=N
We show that, contrary to common belief, Dijkstra’s self-stabilizing mutual exclusion algorithm on a ring [Dij74, Dij82] also stabilizes when the number of states per node is one less than the number of nodes on the ring. keywords: distributed computing, fault tolerance, self-stabilization.
متن کاملA Delay-Optimal Group Mutual Exclusion Algorithm for a Tree Network
The group mutual exclusion problem is an extension of the traditional mutual exclusion problem in which every critical section is associated with a type or a group. Processes requesting critical sections of the same type can execute their critical sections concurrently. However, processes requesting critical sections of different types must execute their critical sections in a mutually exclusiv...
متن کامل